VOROPACK-D: Real-time disk packing algorithm using Voronoi diagram
نویسندگان
چکیده
منابع مشابه
Time - Based Voronoi Diagram ∗
We consider a variation of Voronoi diagram, or time-based Voronoi diagram, for a set S of points in the presence of transportation lines or highways in the plane. A shortest time-distance path from a query point to any given point in S is a path that takes the least travelling time. The travelling speeds and hence travelling times of the subpaths along the highways and in the plane are differen...
متن کاملA Distributed Algorithm for Computing Voronoi Diagram in the Unit Disk Graph Model
We study the problem of computing Voronoi diagrams distributedly for a set of nodes of a network modeled as a Unit Disk Graph (UDG). We present an algorithm to solve this problem efficiently, which has direct applications in wireless networks. Comparing with some existing algorithms, our algorithm correctly computes the complete Voronoi diagram and uses a significantly smaller number of transmi...
متن کاملPoint Cluster Simplification Using Weighted Voronoi Diagram
This paper proposes an algorithm for simplifying point features on maps based on the multiplicatively weighted Voronoi diagram (MWVD). To ensure statistical, thematic, metric, and topological information contained in the original point features can be transmitted correctly after simplification, the algorithm selects corresponding measures to quantify these four types of information, and integra...
متن کاملCTVN: Clustering Technique Using Voronoi Diagram
Clustering technique is one of the most important and basic tool for data mining. We propose a new clustering technique using K-Means algorithm and Voronoi diagram to unfold the hidden pattern in a given dataset. In the first phase we use K-Means algorithm to create set of small clusters and in the next phase using Voronoi diagram we create actual clusters. K-Means and Voronoi diagram based clu...
متن کاملReal time asymptotic packing
A random greedy algorithm, somewhat modified, is analyzed by using a real time context and showing that the variables remain close to the solution of a natural differential equation. Given a (k + 1)-uniform simple hypergraph on N vertices, regular of degree D, the algorithm gives a packing of disjoint hyperedges containing all but O(ND−1/k lnD) of the vertices. Let H = (V, E) be a (k+ 1)-unifor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics and Computation
سال: 2020
ISSN: 0096-3003
DOI: 10.1016/j.amc.2020.125076